-
1 deterministic finite automata
Программирование: детерминированные конечные автоматыУниверсальный англо-русский словарь > deterministic finite automata
-
2 DFA
1) Общая лексика: Фонд Развития Стран Африки (Development Fund for Africa)2) Компьютерная техника: Definite Finite Automata, Deterministic Finite Automata, Direct File Access, Disk First Aid3) Авиация: delayed flaps approach4) Медицина: direct fluorescent antibody5) Американизм: Department Of Finance And Administration6) Военный термин: Death From Above, Defence Facilities Agreement, Dynamic Force Analysis, designated field activity, direction finding antenna7) Техника: damage function analysis, describing function analyzer, digital fault analysis, digital frequency analyzer, disk file address, driver fuel assembly, dummy fuel assembly8) Грубое выражение: Damned Funny Architecture9) Сокращение: Dairy Farmers Association, Doctor of Fine Arts, Department of Foreign Affairs (Департамент иностранных дел (Филиппины))10) Вычислительная техника: Differential Fault Analysis, deterministic finite-state automaton, deterministic finite automaton11) Деловая лексика: Development Facilitation Act12) Автоматика: design for assembly13) Нефть и газ: (сокр. от) Downhole Gluid Analyzer = скважинный анализатор флюидов, внутрискважинный анализатор флюидов, забойный анализатор флюидов ( входит в состав пластоиспытателя на кабеле)14) Общественная организация: Democracy For America15) Правительство: Dog Friendly Area16) Оргтехника: Document Finishing Architecture -
3 DFA's for lexical analyzers
Программирование: ДКА для лексических анализаторов (ДКА - детерминированные конечные автоматы (deterministic finite automata))Универсальный англо-русский словарь > DFA's for lexical analyzers
-
4 optimization of DFA-based pattern matchers
Программирование: оптимизация распознавателей на основе ДКА (ДКА - детерминированные конечные автоматы (deterministic finite automata))Универсальный англо-русский словарь > optimization of DFA-based pattern matchers
См. также в других словарях:
Deterministic finite-state machine — An example of a Deterministic Finite Automaton that accepts only binary numbers that are multiples of 3. The state S0 is both the start state and an accept state. In the theory of computation and automata theory, a deterministic finite state… … Wikipedia
Two-way deterministic finite automaton — In computer science, a two way deterministic finite automaton (2DFA) is an abstract machine, a generalized version of the deterministic finite automaton (DFA) which can revisit characters already processed. As in a DFA, there are a finite number… … Wikipedia
Quantum finite automata — In quantum computing, quantum finite automata or QFA are a quantum analog of probabilistic automata. They are related to quantum computers in a similar fashion as finite automata are related to Turing machines. Several types of automata may be… … Wikipedia
Automata theory — Automata is defined as a system where energy, information and material is transformed, transmitted and used for performing some function without the direct participation of man .In theoretical computer science, automata theory is the study of… … Wikipedia
Deterministic pushdown automaton — In automata theory, a pushdown automaton is a finite automaton with an additional stack of symbols; its transitions can take the top symbol on the stack and depend on its value, and they can add new top symbols to the stack. A deterministic… … Wikipedia
Autómata finito — Un autómata finito (AF) o máquina de estado finito es un modelo matemático que realiza cómputos en forma automática sobre una entrada para producir una salida. Este modelo está conformado por un alfabeto, un conjunto de estados y un conjunto de… … Wikipedia Español
Deterministic automaton — is a concept of automata theory in which the outcome of a transition from one state to another given a certain input can be predicted for every occurrence. A common deterministic automaton is a deterministic finite state machine (sometimes… … Wikipedia
Automata-based programming (Shalyto's approach) — Automata Based Programming is a programming technology [1] . Its defining characteristic is the use of finite state machines to describe program behavior. The transition graphs of a state machines are used in all stages of software development… … Wikipedia
Finite-state machine — State machine redirects here. For infinite state machines, see State transition system. For fault tolerance methodology, see State machine replication. SFSM redirects here. For the Italian railway company, see Circumvesuviana. A finite state… … Wikipedia
automata theory — Body of physical and logical principles underlying the operation of any electromechanical device (an automaton) that converts information input in one form into another, or into some action, according to an algorithm. Norbert Wiener and Alan M.… … Universalium
Finite state machine — A finite state machine (FSM) or finite state automaton (plural: automata ) or simply a state machine, is a model of behavior composed of a finite number of states, transitions between those states, and actions. A finite state machine is an… … Wikipedia